MDP-based Network Friendly Recommendations

نویسندگان

چکیده

Controlling the network cost by delivering popular content to users, as well improving streaming quality and overall user experience, have been key goals for providers (CP) in recent years. While proposals improve performance, through caching or other mechanisms (DASH, multicasting, etc.) abound, works proposed turn problem on its head complement such efforts. Instead of trying reduce deliver every possible a user, potentially very expensive endeavour, one could leverage omnipresent recommendations systems nudge users towards low(er) cost, regardless where this is coming from. In paper, we focus latter problem, namely optimal policies “Network Friendly Recommendations” (NFR). A contribution use Markov Decision Process (MDP) framework that offers significant advantages, compared existing works, terms both modeling flexibility computational efficiency. Specifically show subsumes some state-of-the-art approaches, can also optimally tackle additional, more sophisticated setups. We validate our findings with real traces suggest up almost 2X 10X speed-up works.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experiment-based recommendations for biodiversity- friendly management of mountain haymeadows

Question: The biodiversity of mountain hay meadows has historically been maintained through traditional, low-intensity farming practices. In recent decades, however, agricultural intensification for hay production has led to dramatic declines in their biodiversity. This study asks: which management practices can contribute to maintaining the biodiversity value of mountain hay meadows without je...

متن کامل

An MDP-based Peer-to-Peer Search Server Network

A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a collection of documents available at the server or on other peer machines. When a query is received by any server in the network, a distributed search process determines the most relevant search servers and redirects th...

متن کامل

Network-Friendly Gossiping

The emergence of large-scale distributed applications based on many-to-many communication models, e.g., broadcast and decentralized group communication, has an important impact on the underlying layers, notably the Internet routing infrastructure. To make an e ective use of network resources, protocols should both limit the stress (amount of messages) on each infrastructure entity (routers, lin...

متن کامل

An MDP-based Recommender System

Typical recommender systems adopt a static view of the recommendation process and treat it as a prediction problem. We argue that it is more appropriate to view the problem of generating recommendations as a sequential optimization problem and, consequently, that Markov decision processes (MDPs) provide a more appropriate model for recommender systems. MDPs introduce two benefits: they take int...

متن کامل

NEEM: Network-Friendly Epidemic Multicast

Epidemic, or probabilistic, multicast protocols have emerged as a viable mechanism to circumvent the scalability problems of reliable multicast protocols. However, most existing epidemic approaches use connectionless transport protocols to exchange messages and rely on the intrinsic robustness of the epidemic dissemination to mask network omissions. Unfortunately, such an approach is not networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM transactions on modeling and performance evaluation of computing systems

سال: 2021

ISSN: ['2376-3647', '2376-3639']

DOI: https://doi.org/10.1145/3513131